Path Optimization Using Ant Colony Based Multipath Routing Algorithm

Energy efficiency is always important in wireless sensor networks. In a sensor network the nodes are present with limited energy and in each transmission nodes loss some energy. It is required to minimize the rerouting to save the energy loss. Here An algorithm for energy efficient maximally covered sensor network is presented. The initial route will be identified by the Path Selection algorithm and as any path or node can get broken it would look for the alternate path but using simple Path Selection algorithm it requires rerouting so we need other way. Here other way used is Ant colony based multipath routing algorithm (ACMRA). As we know there are disjoint multipath between the source nodes and sink node. In multipath routing, multiple paths between source and destination are established. The algorithm generates two types of ants: search ant (SANT) and reinforcement ant (RANT). SANT is used to collect information about paths and the intermediate nodes local information as they travel along the path. RANT issued to update the pheromone table along the reverse path, and bring information of path to source node, such as residual energy of the sensor nodes, path length and energy consumed in the current path. In conclusion, a comparison between proposed work and literature proves the efficiency of our work.